#include<bits/stdc++.h>
using namespace std;
int n;
const int N=100005;
priority_queue<int,vector<int>,greater<int>>q;
int s[N];
bool cmp(int x,int y){
    return x<y;
}
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    cin>>n;
    for(int i=0;i<n;i++){
        cin>>s[i];
    }
    sort(s,s+n,cmp);
    q.push(s[0]);
    for(int i=1;i<n;i++){
        int u=q.top();
        if(s[i]>u){
            q.pop();
        }
        q.push(s[i]);
    }
    cout<<q.size();
    return 0;
}
